A duality model of TCP and queue management algorithms

A Duality Model of TCP and Queue Management Algorithms ySteven

In this paper we propose a duality model of congestion control and apply it to TCP and active queue management schemes. Congestion control is the interaction of source rates with certain congestion measures in the network. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a Lagrangian method that iterates on source ...

An Empirical Validation of a Duality Model of Tcp and Queue Management Algorithms

In this paper we validate through simulations a duality model of TCP and active queue management (AQM) proposed earlier. In this model, TCP and AQM are modeled as carrying out a distributed primal-dual algorithm over the Internet to maximize aggregate source utility. TCP congestion avoidance algorithms, such as Reno and Vegas, iterate on source rates, the primal variable. AQM algorithms, such a...

TCP and Queue Management

A Duality Model of TCP Congestion Controls

In this paper we propose a uniied optimization model of TCP ow control based on duality theory. We show that TCP Reno and TCP Vegas, with or without random marking, can be regarded as carrying out a dual method to maximize aggregate source utility. Diierent schemes correspond to diierent choices of source utility functions, and we derive these utility functions. This implies in particular that ...

Efficient Queue Management for TCP Flows

Packets in the Internet can experience large queueing delays during busy periods. Backbone routers are generally engineered to have large buffers, in which packets may wait as long as half a second (assuming FIFO service, longer otherwise). During congestion periods, these bufferfs may stay close to full, subjecting packets to long delays, even when the intrinsic latency of the path is relative...